A Heuristic for Finding Compatible Differential Paths with Application to HAS-160

نویسندگان

  • Aleksandar Kircanski
  • Riham AlTawy
  • Amr M. Youssef
چکیده

The question of compatibility of differential paths plays a central role in second order collision attacks on hash functions. In this context, attacks typically proceed by starting from the middle and constructing the middle-steps quartet in which the two paths are enforced on the respective faces of the quartet structure. Finding paths that can fit in such a quartet structure has been a major challenge and the currently known compatible paths extend over a suboptimal number of steps for hash functions such as SHA-2 and HAS-160. In this paper, we investigate a heuristic that searches for compatible differential paths. The application of the heuristic in case of HAS-160 yields a practical second order collision over all of the function steps, which is the first practical result that covers all of the HAS-160 steps. An example of a colliding quartet is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of Symmetric Cryptographic Primitives

Cryptanalysis of Symmetric Cryptographic Primitives Aleksandar Kircanski, Ph.D. Concordia University, 2013 Symmetric key cryptographic primitives are the essential building blocks in modern information security systems. The overall security of such systems is crucially dependent on these mathematical functions, which makes the analysis of symmetric key primitives a goal of critical importance. ...

متن کامل

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

متن کامل

A two stage model for Cell Formation Problem (CFP) considering the inter-cellular movements by AGVs

This paper addresses to the Cell Formation Problem (CFP) in which Automated Guided Vehicles (AGVs) have been employed to transfer the jobs which may need to visit one or more cells. Because of added constraints to problem such as AGVs’ conflict and excessive cessation on one place, it is possible that AGVs select the different paths from one cell to another over the time. This means that the ti...

متن کامل

FINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS

In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Ser...

متن کامل

Spice Compatible Model for Multiple Coupled Nonuniform Transmission Lines Application in Transient Analysis of VLSI Circuits

An SPICE compatible model for multiple coupled nonuniform lossless transmission lines (TL's) is presented. The method of the modeling is based on the steplines approximation of the nonuniform TLs and quasi-TEM assumptions. Using steplines approximation the system of coupled nonuniform TLs is subdivided into arbitrary large number of coupled uniform lines (steplines) with different characteristi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013